- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Works by Marian Boykan Pour-El
27 found
Order:
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable.Marian Boykan Pour-El & Jerome Caldwell - 1975 - Mathematical Logic Quarterly 21 (1):1-19.
- Effectively extensible theories.Marian Boykan Pour-El - 1968 - Journal of Symbolic Logic 33 (1):56-68.
- Recursively enumerable classes and their application to recursive sequences of formal theories.Marian Boykan Pour-El & Hilary Putnam - 1965 - Archive for Mathematical Logic 8 (3-4):104-121.No categories
- A Comparison of Five “Computable” Operators.Marian Boykan Pour-El - 1960 - Mathematical Logic Quarterly 6 (15‐22):325-340.
- A Comparison of Five “Computable” Operators.Marian Boykan Pour-El - 1960 - Mathematical Logic Quarterly 6 (15-22):325-340.
- A structural criterion for recursive enumeration without repetition.Marian Boykan Pour-El & William A. Howard - 1964 - Mathematical Logic Quarterly 10 (8):105-114.No categories
- A structural criterion for recursive enumeration without repetition.Marian Boykan Pour-El & William A. Howard - 1964 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (8):105-114.No categories
- A Recursion‐theoretic View of Axiomatizable Theories.Marian Boykan Pour-El - 1970 - Dialectica 24 (4):267-276.
- Donald A. Martin. A theorem on hyper hypersimple sets. The journal of symbolic logic, vol. 28 no. 4 , pp. 273–278.Marian Boykan Pour-El - 1966 - Journal of Symbolic Logic 31 (1):139-139.
- Independent Axiomatization and its Relation to the Hypersimple Set.Marian Boykan Pour-El - 1968 - Mathematical Logic Quarterly 14 (25-29):449-456.
- J. S. Ullian. Splinters of recursive functions. The journal of symbolic logic, vol. 25 no. 1 , pp. 33–38.Marian Boykan Pour-El - 1966 - Journal of Symbolic Logic 31 (1):138-139.
- Recursively Enumerable Classes and Their Application to Recursive Sequences of Formal Theories.Marian Boykan Pour-el, Hilary Putnam, William A. Howard & A. H. Lachlan - 1973 - Journal of Symbolic Logic 38 (1):155-156.
- Review: Richard Friedberg, Un Contre-Exemple Relatif aux Fonctionnelles Recursives. [REVIEW]Marian Boykan Pour-El - 1959 - Journal of Symbolic Logic 24 (2):171-171.
- Boone William W.. Partial results regarding word problems and recursively enumerable degrees of unsolvability. Bulletin of the American Mathematical Society, vol. 68 , pp. 616–623. [REVIEW]Marian Boykan Pour-El - 1963 - Journal of Symbolic Logic 28 (4):292-292.
- Friedberg Richard M.. A criterion for completeness of degrees of unsolvability. [REVIEW]Marian Boykan Pour-El - 1960 - Journal of Symbolic Logic 25 (2):165-165.
- Friedberg Richard. The uniqueness of finite division for recursive equivalence types. Mathematische Zeitschrift, vol. 75 , pp. 3–7. [REVIEW]Marian Boykan Pour-El - 1960 - Journal of Symbolic Logic 25 (4):363-363.
- Friedberg Richard. Un contre-exemple relatif aux fonctionnelles récursives. Comptes rendus hebdomadaires des séances de l'Académie des Sciences , vol. 247 , pp. 852–854. [REVIEW]Marian Boykan Pour-El - 1959 - Journal of Symbolic Logic 24 (2):171-171.
- Gerald E. Sacks. On the degrees less than 0′. Annals of mathematics, second series, vol. 77 , pp. 211–231. - Gerald E. Sacks. Correction to “On the degrees less than 0′.”Annals of mathematics, second series, vol. 78 , p. 204. [REVIEW]Marian Boykan Pour-El - 1964 - Journal of Symbolic Logic 29 (1):60.
- Review: Donald A. Martin, A Theorem on Hyperhypersimple Sets. [REVIEW]Marian Boykan Pour-El - 1966 - Journal of Symbolic Logic 31 (1):139-139.
- Review: Gerald E. Sacks, On the Degrees Less than 0'. [REVIEW]Marian Boykan Pour-El - 1964 - Journal of Symbolic Logic 29 (1):60-60.
- Review: J. S. Ullian, Splinters of Recursive Functions. [REVIEW]Marian Boykan Pour-El - 1966 - Journal of Symbolic Logic 31 (1):138-139.Export citation
Bookmark - Raymond M. Smullyan. Theory of formal systems. Annals of Mathematics studies, no. 47. Princeton University Press, Princeton1961, xi + 142 pp. - Raymond M. Smullyan. Theory of formal systems. Revised edition. Annals of Mathematics studies, no. 47. Princeton University Press, Princeton1961, xi + 147 pp. [REVIEW]Marian Boykan Pour-El - 1965 - Journal of Symbolic Logic 30 (1):88-90.
- Review: Richard Friedberg, The Uniqueness of Finite Division for Recursive Equivalence Types. [REVIEW]Marian Boykan Pour-El - 1960 - Journal of Symbolic Logic 25 (4):363-363.
- Review: Raymond M. Smullyan, Theory of Formal Systems. [REVIEW]Marian Boykan Pour-El - 1965 - Journal of Symbolic Logic 30 (1):88-90.
- Review: Richard M. Friedberg, Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration Without Duplication. [REVIEW]Marian Boykan Pour-El - 1960 - Journal of Symbolic Logic 25 (2):165-166.
- Review: Richard M. Friedberg, A Criterion for Completeness of Degrees of Unsolvability. [REVIEW]Marian Boykan Pour-El - 1960 - Journal of Symbolic Logic 25 (2):165-165.
- Review: William W. Boone, Partial Results Regarding Word Problems and Recursively Enumerable Degrees of Unsolvability. [REVIEW]Marian Boykan Pour-El - 1963 - Journal of Symbolic Logic 28 (4):292-292.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-d2cnv uwo